Codes correcting and simultaneously detecting solid burst errors

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codes Correcting Repeated Burst Errors Blockwise

This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65

متن کامل

Blockwise Solid Burst Error Correcting Codes

This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.

متن کامل

Optimal codes for correcting single errors and detecting adjacent errors

Optimal codes that correct single errors and detect double errors within nibbles of power of two length are presented. For each n, a code of length n, with the largest possible dimension which corrects single errors and detects double adjacent errors is presented. The problem of constructing optimal codes, which correct single errors and detect double adjacent errors within nibbles of length 1 ...

متن کامل

Spatially correlated qubit errors and burst-correcting quantum codes

We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, we construct a ...

متن کامل

On Linear Codes Correcting Random and Low-Denslty Burst Errors

This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Engineering and Applications Journal

سال: 2013

ISSN: 2252-5459,2252-4274

DOI: 10.18495/comengapp.v2i1.15